0.10/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.14/0.14	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.14/0.35	% Computer   : n009.cluster.edu
0.14/0.35	% Model      : x86_64 x86_64
0.14/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory     : 8042.1875MB
0.14/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 1200
0.14/0.35	% WCLimit    : 120
0.14/0.35	% DateTime   : Tue Jul 13 12:59:12 EDT 2021
0.14/0.35	% CPUTime    : 
0.14/0.35	% Number of cores: 8
0.21/0.36	% Python version: Python 3.6.8
0.21/0.36	# Version: 2.6rc1-ho
0.21/0.37	# No SInE strategy applied
0.21/0.37	# Trying AutoSched0 for 59 seconds
59.20/59.37	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
59.20/59.37	# and selection function SelectMaxLComplexAvoidPosPred.
59.20/59.37	#
59.20/59.37	# Preprocessing time       : 0.061 s
59.29/59.46	# No success with AutoSched0
59.29/59.46	# Trying AutoSched1 for 26 seconds
59.29/59.52	# AutoSched1-Mode selected heuristic G_E___008_C45_F1_PI_SE_Q4_CS_SP_S4SI
59.29/59.52	# and selection function SelectNewComplexAHPNS.
59.29/59.52	#
59.29/59.52	# Preprocessing time       : 0.028 s
59.29/59.52	
59.29/59.52	# Proof found!
59.29/59.52	# SZS status Theorem
59.29/59.52	# SZS output start CNFRefutation
59.29/59.52	thf(fact_1_hfunction__def, axiom, (hF_Mir199975595nction)=(^[X1:hF_Mirabelle_hf]:![X2:hF_Mirabelle_hf, X3:hF_Mirabelle_hf]:(![X4:hF_Mirabelle_hf]:(hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ X2 @ X4) @ X1=>(X3)=(X4))<=hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ X2 @ X3) @ X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_1_hfunction__def)).
59.29/59.52	thf(conj_1, conjecture, hF_Mir199975595nction @ (hF_Mir1653039215strict @ r @ x), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_1)).
59.29/59.52	thf(fact_2_hrestrict__iff, axiom, ![X12:hF_Mirabelle_hf, X72:hF_Mirabelle_hf, X10:hF_Mirabelle_hf]:(hF_Mirabelle_hmem @ X12 @ (hF_Mir1653039215strict @ X72 @ X10)<=>(hF_Mirabelle_hmem @ X12 @ X72&?[X2:hF_Mirabelle_hf, X3:hF_Mirabelle_hf]:((X12)=(hF_Mirabelle_hpair @ X2 @ X3)&hF_Mirabelle_hmem @ X2 @ X10))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_2_hrestrict__iff)).
59.29/59.52	thf(conj_0, hypothesis, hF_Mir199975595nction @ r, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
59.29/59.52	thf(c_0_4, plain, ![X1:hF_Mirabelle_hf]:(hF_Mir199975595nction @ X1<=>![X1345:hF_Mirabelle_hf, X1346:hF_Mirabelle_hf]:(hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ X1345 @ X1346) @ X1=>![X1347:hF_Mirabelle_hf]:(hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ X1345 @ X1347) @ X1=>(X1346)=(X1347)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_1_hfunction__def])])).
59.29/59.52	thf(c_0_5, negated_conjecture, ~hF_Mir199975595nction @ (hF_Mir1653039215strict @ r @ x), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])])).
59.29/59.52	thf(c_0_6, plain, ![X1355:hF_Mirabelle_hf, X1356:hF_Mirabelle_hf, X1357:hF_Mirabelle_hf, X1358:hF_Mirabelle_hf, X1359:hF_Mirabelle_hf]:((~hF_Mir199975595nction @ X1355|(~hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ X1356 @ X1357) @ X1355|(~hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ X1356 @ X1358) @ X1355|(X1357)=(X1358))))&((hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ (esk1_1 @ X1359) @ (esk2_1 @ X1359)) @ X1359|hF_Mir199975595nction @ X1359)&((hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ (esk1_1 @ X1359) @ (esk3_1 @ X1359)) @ X1359|hF_Mir199975595nction @ X1359)&((esk2_1 @ X1359)!=(esk3_1 @ X1359)|hF_Mir199975595nction @ X1359)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])])).
59.29/59.52	thf(c_0_7, plain, ![X1664:hF_Mirabelle_hf, X1665:hF_Mirabelle_hf, X1666:hF_Mirabelle_hf, X1669:hF_Mirabelle_hf, X1670:hF_Mirabelle_hf, X1671:hF_Mirabelle_hf, X1672:hF_Mirabelle_hf, X1673:hF_Mirabelle_hf]:(((hF_Mirabelle_hmem @ X1664 @ X1665|~hF_Mirabelle_hmem @ X1664 @ (hF_Mir1653039215strict @ X1665 @ X1666))&(((X1664)=(hF_Mirabelle_hpair @ (esk31_3 @ X1664 @ X1665 @ X1666) @ (esk32_3 @ X1664 @ X1665 @ X1666))|~hF_Mirabelle_hmem @ X1664 @ (hF_Mir1653039215strict @ X1665 @ X1666))&(hF_Mirabelle_hmem @ (esk31_3 @ X1664 @ X1665 @ X1666) @ X1666|~hF_Mirabelle_hmem @ X1664 @ (hF_Mir1653039215strict @ X1665 @ X1666))))&(~hF_Mirabelle_hmem @ X1669 @ X1670|((X1669)!=(hF_Mirabelle_hpair @ X1672 @ X1673)|~hF_Mirabelle_hmem @ X1672 @ X1671)|hF_Mirabelle_hmem @ X1669 @ (hF_Mir1653039215strict @ X1670 @ X1671))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2_hrestrict__iff])])])])])])).
59.29/59.52	thf(c_0_8, negated_conjecture, ~hF_Mir199975595nction @ (hF_Mir1653039215strict @ r @ x), inference(split_conjunct,[status(thm)],[c_0_5])).
59.29/59.52	thf(c_0_9, plain, ![X1:hF_Mirabelle_hf]:(hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ (esk1_1 @ X1) @ (esk2_1 @ X1)) @ X1|hF_Mir199975595nction @ X1), inference(split_conjunct,[status(thm)],[c_0_6])).
59.29/59.52	thf(c_0_10, plain, ![X1:hF_Mirabelle_hf, X2:hF_Mirabelle_hf, X3:hF_Mirabelle_hf]:(hF_Mirabelle_hmem @ X1 @ X2|~hF_Mirabelle_hmem @ X1 @ (hF_Mir1653039215strict @ X2 @ X3)), inference(split_conjunct,[status(thm)],[c_0_7])).
59.29/59.52	thf(c_0_11, negated_conjecture, hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ (esk1_1 @ (hF_Mir1653039215strict @ r @ x)) @ (esk2_1 @ (hF_Mir1653039215strict @ r @ x))) @ (hF_Mir1653039215strict @ r @ x), inference(spm,[status(thm)],[c_0_8, c_0_9])).
59.29/59.52	thf(c_0_12, plain, ![X1:hF_Mirabelle_hf]:(hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ (esk1_1 @ X1) @ (esk3_1 @ X1)) @ X1|hF_Mir199975595nction @ X1), inference(split_conjunct,[status(thm)],[c_0_6])).
59.29/59.52	thf(c_0_13, plain, ![X2:hF_Mirabelle_hf, X4:hF_Mirabelle_hf, X3:hF_Mirabelle_hf, X1:hF_Mirabelle_hf]:((X3)=(X4)|~hF_Mir199975595nction @ X1|~hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ X2 @ X3) @ X1|~hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ X2 @ X4) @ X1), inference(split_conjunct,[status(thm)],[c_0_6])).
59.29/59.52	thf(c_0_14, negated_conjecture, hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ (esk1_1 @ (hF_Mir1653039215strict @ r @ x)) @ (esk2_1 @ (hF_Mir1653039215strict @ r @ x))) @ r, inference(spm,[status(thm)],[c_0_10, c_0_11])).
59.29/59.52	thf(c_0_15, hypothesis, hF_Mir199975595nction @ r, inference(split_conjunct,[status(thm)],[conj_0])).
59.29/59.52	thf(c_0_16, negated_conjecture, hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ (esk1_1 @ (hF_Mir1653039215strict @ r @ x)) @ (esk3_1 @ (hF_Mir1653039215strict @ r @ x))) @ (hF_Mir1653039215strict @ r @ x), inference(spm,[status(thm)],[c_0_8, c_0_12])).
59.29/59.52	thf(c_0_17, negated_conjecture, ![X1:hF_Mirabelle_hf]:((X1)=(esk2_1 @ (hF_Mir1653039215strict @ r @ x))|~hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ (esk1_1 @ (hF_Mir1653039215strict @ r @ x)) @ X1) @ r), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15])])).
59.29/59.52	thf(c_0_18, negated_conjecture, hF_Mirabelle_hmem @ (hF_Mirabelle_hpair @ (esk1_1 @ (hF_Mir1653039215strict @ r @ x)) @ (esk3_1 @ (hF_Mir1653039215strict @ r @ x))) @ r, inference(spm,[status(thm)],[c_0_10, c_0_16])).
59.29/59.52	thf(c_0_19, plain, ![X1:hF_Mirabelle_hf]:(hF_Mir199975595nction @ X1|(esk2_1 @ X1)!=(esk3_1 @ X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
59.29/59.52	thf(c_0_20, negated_conjecture, (esk3_1 @ (hF_Mir1653039215strict @ r @ x))=(esk2_1 @ (hF_Mir1653039215strict @ r @ x)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
59.29/59.52	thf(c_0_21, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_8]), ['proof']).
59.29/59.52	# SZS output end CNFRefutation
59.29/59.52	# Proof object total steps             : 22
59.29/59.52	# Proof object clause steps            : 14
59.29/59.52	# Proof object formula steps           : 8
59.29/59.52	# Proof object conjectures             : 10
59.29/59.52	# Proof object clause conjectures      : 8
59.29/59.52	# Proof object formula conjectures     : 2
59.29/59.52	# Proof object initial clauses used    : 7
59.29/59.52	# Proof object initial formulas used   : 4
59.29/59.52	# Proof object generating inferences   : 7
59.29/59.52	# Proof object simplifying inferences  : 3
59.29/59.52	# Training examples: 0 positive, 0 negative
59.29/59.52	# Parsed axioms                        : 408
59.29/59.52	# Removed by relevancy pruning/SinE    : 0
59.29/59.52	# Initial clauses                      : 616
59.29/59.52	# Removed in clause preprocessing      : 74
59.29/59.52	# Initial clauses in saturation        : 542
59.29/59.52	# Processed clauses                    : 955
59.29/59.52	# ...of these trivial                  : 76
59.29/59.52	# ...subsumed                          : 255
59.29/59.52	# ...remaining for further processing  : 624
59.29/59.52	# Other redundant clauses eliminated   : 182
59.29/59.52	# Clauses deleted for lack of memory   : 0
59.29/59.52	# Backward-subsumed                    : 4
59.29/59.52	# Backward-rewritten                   : 15
59.29/59.52	# Generated clauses                    : 4877
59.29/59.52	# ...of the previous two non-trivial   : 3579
59.29/59.52	# Contextual simplify-reflections      : 0
59.29/59.52	# Paramodulations                      : 4185
59.29/59.52	# Factorizations                       : 18
59.29/59.52	# NegExts                              : 74
59.29/59.52	# Equation resolutions                 : 201
59.29/59.52	# Propositional unsat checks           : 0
59.29/59.52	#    Propositional check models        : 0
59.29/59.52	#    Propositional check unsatisfiable : 0
59.29/59.53	#    Propositional clauses             : 0
59.29/59.53	#    Propositional clauses after purity: 0
59.29/59.53	#    Propositional unsat core size     : 0
59.29/59.53	#    Propositional preprocessing time  : 0.000
59.29/59.53	#    Propositional encoding time       : 0.000
59.29/59.53	#    Propositional solver time         : 0.000
59.29/59.53	#    Success case prop preproc time    : 0.000
59.29/59.53	#    Success case prop encoding time   : 0.000
59.29/59.53	#    Success case prop solver time     : 0.000
59.29/59.53	# Current number of processed clauses  : 526
59.29/59.53	#    Positive orientable unit clauses  : 167
59.29/59.53	#    Positive unorientable unit clauses: 14
59.29/59.53	#    Negative unit clauses             : 16
59.29/59.53	#    Non-unit-clauses                  : 329
59.29/59.53	# Current number of unprocessed clauses: 3133
59.29/59.53	# ...number of literals in the above   : 7513
59.29/59.53	# Current number of archived formulas  : 0
59.29/59.53	# Current number of archived clauses   : 34
59.29/59.53	# Clause-clause subsumption calls (NU) : 26014
59.29/59.53	# Rec. Clause-clause subsumption calls : 20958
59.29/59.53	# Non-unit clause-clause subsumptions  : 196
59.29/59.53	# Unit Clause-clause subsumption calls : 1512
59.29/59.53	# Rewrite failures with RHS unbound    : 0
59.29/59.53	# BW rewrite match attempts            : 177
59.29/59.53	# BW rewrite match successes           : 132
59.29/59.53	# Condensation attempts                : 0
59.29/59.53	# Condensation successes               : 0
59.29/59.53	# Termbank termtop insertions          : 85354
59.29/59.53	
59.29/59.53	# -------------------------------------------------
59.29/59.53	# User time                : 58.044 s
59.29/59.53	# System time              : 1.125 s
59.29/59.53	# Total time               : 59.169 s
59.29/59.53	# Maximum resident set size: 2368 pages
59.29/59.53	EOF